\hypertarget{bfs_8h}{}\section{src/graph\+\_\+algorithms/basic\+\_\+graph/graph\+\_\+bfs/bfs.h File Reference}
\label{bfs_8h}\index{src/graph\+\_\+algorithms/basic\+\_\+graph/graph\+\_\+bfs/bfs.\+h@{src/graph\+\_\+algorithms/basic\+\_\+graph/graph\+\_\+bfs/bfs.\+h}}
{\ttfamily \#include $<$memory$>$}\\*
{\ttfamily \#include $<$queue$>$}\\*
{\ttfamily \#include $<$functional$>$}\\*
{\ttfamily \#include \char`\"{}src/header.\+h\char`\"{}}\\*
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespace_introduction_to_algorithm}{Introduction\+To\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of Introdunction\+To\+Algorithm. \end{DoxyCompactList}\item 
 \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm}
\begin{DoxyCompactList}\small\item\em Namespace of \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm}{Graph\+Algorithm}. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Graph\+Type $>$ }\\void \hyperlink{namespace_introduction_to_algorithm_1_1_graph_algorithm_a8839165b9e3d4c8c2ccac4cdc28aadd5}{Introduction\+To\+Algorithm\+::\+Graph\+Algorithm\+::breadth\+\_\+first\+\_\+search} (std\+::shared\+\_\+ptr$<$ Graph\+Type $>$ graph, typename Graph\+Type\+::\+V\+I\+D\+Type source\+\_\+id, std\+::function$<$ void(typename Graph\+Type\+::\+V\+I\+D\+Type)$>$ pre\+\_\+action=\mbox{[}$\,$\mbox{]}(typename Graph\+Type\+::\+V\+I\+D\+Type)\{\}, std\+::function$<$ void(typename Graph\+Type\+::\+V\+I\+D\+Type)$>$ post\+\_\+action=\mbox{[}$\,$\mbox{]}(typename Graph\+Type\+::\+V\+I\+D\+Type)\{\})
\begin{DoxyCompactList}\small\item\em breadth\+\_\+first\+\_\+search：广度优先搜索，算法导论22章22.2节 \end{DoxyCompactList}\end{DoxyCompactItemize}
